Parsing with Categorial Grammars Workshop ESSLLI 2009 Bordeaux , France
نویسندگان
چکیده
We propose a new method to perform lexical disambiguation of Interaction Grammars. It deals with the order constraints on words. Actually, the soundness of the method is due to an invariant property of the parsing of an Interaction Grammar. We show how this invariant can be computed statically from the grammar.
منابع مشابه
Resource Logics and Minimalist Grammars
This ESSLLI workshop is devoted to connecting the linguistic use of resource logics and categorial grammar to minimalist grammars and related generative grammars. Minimalist grammars are relatively recent, and although they stem from a long tradition of work in transformational grammar, they are largely informal apart from a few research papers. The study of resource logic, on the other hand, i...
متن کاملCategorial Grammars ESSLLI Notes ( 2005 , Edinburgh , Scotland ) Philippe de Groote Sylvain
Categorial Grammars ESSLLI Notes (2005, Edinburgh, Scotland) Philippe de Groote Sylvain Pogodalla
متن کاملReasoning with Probabilities
This is an outline for the course “Reasoning with Probabilities” taught at the European Summer School for Logic, Language and Information in Bordeaux, France on July 26 31, 2009 (ESSLLI 2009). This document contains an extended outline of the course including pointers to relevant literature. The course website: ai.stanford.edu/∼epacuit/classes/esslli/epprob.html will contain the slides and a sc...
متن کاملPPQ : a pregroup parser using majority composition
Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalism like Lambek calculus but have a polynomial parsing algorithm. The paper presents a parser based on pregroup grammar that uses a tabular approach based on majority partial composition.
متن کاملA Savateev-Style Parsing Algorithm for Pregroup Grammars
We present a new cubic parsing algorithm for ambiguous pregroup grammars. It modifies the recognition algorithm of Savateev [10] for categorial grammars based on L\. We show the correctness of the algorithm and give some examples. We compare our algorithm with the algorithm of Oehrle [8] for pregroup grammars and the algorithm of
متن کامل